Textures on Rank-1 Lattices
نویسندگان
چکیده
Storing textures on orthogonal tensor product lattices is predominant in computer graphics, although it is known that their sampling efficiency is not optimal. In two dimensions, the hexagonal lattice provides the maximum sampling efficiency. However, handling these lattices is difficult, because they are not able to tile an arbitrary rectangular region and have an irrational basis. By storing textures on rank-1 lattices, we resolve both problems: Rank-1 lattices can closely approximate hexagonal lattices, while all coordinates of the lattice points remain integer. At identical memory footprint texture quality is improved as compared to traditional orthogonal tensor product lattices due to the higher sampling efficiency. We introduce the basic theory of rank-1 lattice textures and present an algorithmic framework which easily can be integrated into existing off-line and real-time rendering systems.
منابع مشابه
Some observations on the effects of slant and texture type on slant-from-texture
We measure the performance of five subjects in a two-alternative-forced-choice slant-discrimination task for differently textured planes. As textures we used uniform lattices, randomly displaced lattices, circles (polka dots), Voronoi tessellations, plaids, 1/f noise, "coherent" noise and a leopard skin-like texture. Our results show: (1) Improving performance with larger slants for all texture...
متن کاملCategories of fuzzy topology in the context of graded ditopologies on textures
This paper extends the notion of ditopology to the case where openness and closedness are given in terms of {em a priori} unrelated Drading functions. The resulting notion of graded ditopology is considered both in the setting of lattices and in that textures, the relation between the two approaches being discussed in detail. Interrelations between graded ditopologies and ditopologies on textur...
متن کاملSimulation on Rank-1 Lattices
Rank-1 lattices are available in any dimension for any number of lattice points and because their generation is so efficient, they often are used in quasi-Monte Carlo methods. Applying the Fourier transform to functions sampled on rank-1 lattice points turns out to be simple and efficient if the number of lattice points is a power of two. Considering the Voronoi diagram of a rank-1 lattice as a...
متن کاملUniversal Z-lattices of Minimal Rank
Let UZ(n) be the minimal rank of n-universal Z-lattices, by which we mean positive definite Z-lattices which represent all positive Z-lattices of rank n. It is a well known fact that UZ(n) = n + 3 for 1 ≤ n ≤ 5. In this paper, we determine UZ(n) and find all n-universal lattices of rank UZ(n) for 6 ≤ n ≤ 8.
متن کاملTrees and Discrete Subgroups of Lie Groups over Local Fields
Let K be a locally compact field and G a simple AT-group, G = G(K). A discrete subgroup T of G is called a lattice if G/F carries a finite G-invariant measure. It is a uniform (or cocompact) lattice if G/T is compact and nonuniform otherwise. When the jRf-rank of G is greater than one, Margulis [Ma, Z] proved that T is arithmetic, establishing the conjecture of Selberg and PiatetskiShapiro. Thi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Graph. Forum
دوره 28 شماره
صفحات -
تاریخ انتشار 2009